Compilation of Interaction Nets
نویسندگان
چکیده
This paper is about a new implementation technique for interaction nets—a visual programming language based on graph rewriting. We compile interaction nets to C, which offers a robust and efficient implementation, in addition to portability. In the presentation of this work we extend the interaction net programming paradigm to introduce a number of features which make it a practical programming language.
منابع مشابه
An Implementation Model for Interaction Nets
To study implementations and optimisations of interaction net systems we propose a calculus to allow us to reason about nets, a concrete data-structure that is in close correspondence with the calculus, and a low-level language to create and manipulate this data structure. These work together so that we can describe the compilation process for interaction nets, reason about the behaviours of th...
متن کاملInteraction nets: programming language design and implementation
This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. In the same way that the λ -calculus is the foundation for functional programming, or horn clauses are the foundation for logic programming, we give in this paper an overview of a substantial software system that is curr...
متن کاملA Simple Parallel Implementation of Interaction Nets in Haskell
The interaction nets introduced by Lafont [Laf90] can be considered as a variant of term graphs, and therewith as a kind of graphs used as representation of terms. Interaction nets are equipped with an “inherently parallel” local and confluent reduction mechanism that makes them an, at least conceptually, attractive target for (functional) programming language implementation. However, to date t...
متن کاملFrom Functional Programs to Interaction Nets via the Rewriting Calculus
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, where pattern-matching and ‘traditional’ β-reduction can proceed in parallel without overheads.
متن کاملSoftware Implementation of Petri nets and compilation of rule-based systems
The aim of this paper is to discuss the issue of high-level Petri nets implementation. The specific class of high-level net considered is such that tokens are objects and transitions are rules with variables. They are a special case of Predicate/Transition nets. The implementation technique proposed here is an adaptation of the compilation technique developed for rule-based systems preserving t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 253 شماره
صفحات -
تاریخ انتشار 2009